Adaptive Binary PSO based Unit Commitment
نویسندگان
چکیده
This paper presents a binary PSO based solution technique for power system unit commitment. The intelligent generation of initial population and the repairing mechanism ensure feasible solution that satisfies the spinning reserve and unit minimum up/down constraints. The algorithm adoptively adjusts the inertia weight and the acceleration coefficients in order to enhance the search process and arrive at the global optimum. Numerical results on systems up to 100 generating units demonstrate the effectiveness of the proposed strategy.
منابع مشابه
Solving Unit Commitment Problem Using Chemo-tactic PSO–DE Optimization Algorithm Combined with Lagrange Relaxation
This paper presents Chemo-tactic PSO-DE (CPSO-DE) optimization algorithm combined with Lagrange Relaxation method (LR) for solving Unit Commitment (UC) problem. The proposed approach employs Chemo-tactic PSO-DE algorithm for optimal settings of Lagrange multipliers. It provides high-quality performance and reaches global solution and is a hybrid heuristic algorithm based on Bacterial Foraging O...
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کاملParallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملBidding Strategies for Generation Companies in a Day-ahead Market using Fuzzy Adaptive Particle Swarm Optimization
This paper presents a methodology based on Fuzzy Adaptive Particle Swarm Optimization (FAPSO) for the preparation of optimal bidding strategies corresponding unit commitment by Generation companies (Gencos) in order to gain maximum profits in a day-ahead electricity market. In a competitive electricity market with limited number of suppliers, Gencos are facing an oligopoly market rather than a ...
متن کاملParticle Swarm Optimization Based Lagrangian Relaxation Method for Unit Commitment
This thesis proposes a two-stage optimization for solving unit commitment. In the first stage, Lagrangian Relaxation (LR) method is used to solve unit commitment using a sub-gradient algorithm for updating Lagrange multipliers. In the second stage, Particle Swarm Optimization (PSO) is applied to update Lagrange multipliers in the Lagrangian Relaxation method (PSOLR). Lagrange multipliers soluti...
متن کامل